# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def rearrangeArray(self, nums: List[int]) -> List[int]:
        ans = []
        nums_count = len(nums)
        pos, neg = 0, 0

        for i in range(nums_count):
            while pos < nums_count and nums[pos] < 0:
                pos += 1
            if pos < nums_count:
                ans.append(nums[pos])
            pos += 1

            while neg < nums_count and nums[neg] > 0:
                neg += 1
            if neg < nums_count:
                ans.append(nums[neg])
            neg += 1

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([3, 1, -2, -5, 2, -4], [3, -2, 1, -5, 2, -4]),
        ([-1, 1], [1, -1])
    ]

    for case_item in testcases:
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.rearrangeArray(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

